Discovering Association Rules in Incomplete Transactional Databases
نویسندگان
چکیده
The problem of incomplete data in the data mining is well known. In the literature many solutions to deal with missing values in various knowledge discovery tasks were presented and discussed. In the area of association rules the problem was presented mainly in the context of relational data. However, the methods proposed for incomplete relational database can not be easily adapted to incomplete transactional data. In this paper we introduce postulates of a statistically justified approach to discovering rules from incomplete transactional data and present the new approach to this problem, satisfying the postulates.
منابع مشابه
An Efficient Algorithm for Mining Association Rules for Large Itemsets in Large Databases
237 Abstract— The data mining of association rules between items in a large database is an essential research aspect in the data mining fields. Discovering these associations is beneficial to the correct and appropriate decision made by decision-makers. A well-known problem that limits the practical usage of association rule mining algorithms is the extremely large number of rules generated. Su...
متن کاملDistance-Based Methods for Association Rule Mining
Association rules are one of the most frequently used types of knowledge discovered from databases. The problem of discovering association rules was first introduced in (Agrawal, Imielinski & Swami, 1993). Here, association rules are discovered from transactional databases –a set of transactions where a transaction is a set of items. An association rule is an expression of a form A⇒B where A an...
متن کاملAnalytical Study of Algorithms for Mining Association Rules from Probabilistic Databases and future possibilities
we consider the problem of discovering frequent item sets and association rules between items in a large database of transactional databases acquired under uncertainty. With each transaction associated is a probability gives the confidence that the transaction will occur. We discuss generalized algorithms for solving this problem that are fundamentally different from the known algorithms. Compl...
متن کاملAn Enhanced Apriori Algorithm for Discovering Frequent Patterns with Optimal Number of Scans
Data mining is wide spreading its applications in several areas. There are different tasks in mining which provides solutions for wide variety of problems in order to discover knowledge. Among those tasks association mining plays a pivotal role for identifying frequent patterns. Among the available association mining algorithms Apriori algorithm is one of the most prevalent and dominant algorit...
متن کاملA Novel Algorithm for Mining Hybrid-Dimensional Association Rules
The important issue for association rules generation is the discovery of frequent itemset in data mining. Most of the existing real time transactional databases are multidimensional in nature. The classical Apriori algorithm mainly concerned with handling single level, single-dimensional boolean association rules. These algorithms scan the transactional databases or datasets many times to find ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Trans. Rough Sets
دوره 6 شماره
صفحات -
تاریخ انتشار 2007